An STL Hash Table Implementation With Gradual Resizing
نویسندگان
چکیده
This paper describes an implementation of hash tables that conforms to the proposed requirements in Hash Tables for the Standard Template Library by Barreiro Fraley and Musser The main characteristics of the implementation are its separate chaining table organization and its use of gradual resizing to maintain expected constant time performance
منابع مشابه
Fast Integer Search
This paper explores the design and implementation of the Fast Integer Search (FIS) algorithm. We discuss work previously done on the topic of integer searches and then present our own solution to this problem. Our solution uses a combination of existing data structures; the trie, the linked list and the hash table in an attempt to achieve a running time of better than O(lg n). We show our imple...
متن کاملFast, Dynamically-Sized Concurrent Hash Table
We present a new design and a C++ implementation of a high-performance, cache-efficient hash table suitable for use in implementation of parallel programs in shared memory. Among the main design criteria were the ability to efficiently use variable-length keys, dynamic table resizing to accommodate data sets of unpredictable size and fully concurrent read-write access. We show that the design i...
متن کاملHash Function for Geometry Reconstruction in Rapid Prototyping
There are many applications where data structures use a hash function. The hash data structures are widely used across all fields of computer science. Nevertheless the design or selection of hash function for data sets with unknown properties is a problem. The Rapid Prototyping uses STL format, where a set of triangles is used to represent a surface of the object. It is necessary to construct t...
متن کاملLock-free atom garbage collection for multithreaded Prolog
The runtime system of dynamic languages such as Prolog or Lisp and their derivatives contain a symbol table, in Prolog often called the atom table. A simple dynamically resizing hash-table used to be an adequate way to implement this table. As Prolog becomes fashionable for 24 × 7 server processes we need to deal with atom garbage collection and concurrent access to the atom table. Classical lo...
متن کاملRationale for Adding Hash Tables to the C Standard Template Library
In Hash Tables for the Standard Template Library Barreiro Fraley and Musser propose a restructuring and extension of the STL requirements for associative containers to accommodate hash table implementations This paper gives the rationale for the proposed changes
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009